Conference Proceedings
Quit while ahead: Evaluating truncated rankings
F Liu, A Moffat, T Baldwin, X Zhang
Association for Computing Machinery (ACM) | Published : 2016
Abstract
© 2016 ACM. Many types of search tasks are answered through the computation of a ranked list of suggested answers. We re-examine the usual assumption that answer lists should be as long as possible, and suggest that when the number of matching items is potentially small - perhaps even zero - it may be more helpful to "quit while ahead", that is, to truncate the answer ranking earlier rather than later. To capture this effect, metrics are required which are attuned to the length of the ranking, and can handle cases in which there are no relevant documents. In this work we explore a generalized approach for representing truncated result sets, and propose modifications to a number of popular ev..
View full abstractGrants
Awarded by Australian Research Council
Funding Acknowledgements
The authors thank MACE Engineering Group for their early support of this work. The third author was supported by ARC grant FT120100658.